Separable dynamic programming and approximate decomposition methodsBERTSEKAS, Dimitri P.IEEE transactions on automatic control. 2007, Vol 52, Num 5, pp 911-916, issn 0018-9286, 6 p.Article

Temporal Difference Methods for General Projected EquationsBERTSEKAS, Dimitri P.IEEE transactions on automatic control. 2011, Vol 56, Num 9, pp 2128-2139, issn 0018-9286, 12 p.Article

Incremental proximal methods for large scale convex optimizationBERTSEKAS, Dimitri P.Mathematical programming (Print). 2011, Vol 129, Num 2, pp 163-195, issn 0025-5610, 33 p.Conference Paper

Distributed power control algorithms for wireless networksWU, Cynara; BERTSEKAS, Dimitri P.IEEE transactions on vehicular technology. 2001, Vol 50, Num 2, pp 504-514, issn 0018-9545Article

The effect of deterministic noise in subgradient methodsNEDIC, Angelia; BERTSEKAS, Dimitri P.Mathematical programming (Print). 2010, Vol 125, Num 1, pp 75-99, issn 0025-5610, 25 p.Article

Convergence Results for Some Temporal Difference Methods Based on Least SquaresHUIZHEN YU; BERTSEKAS, Dimitri P.IEEE transactions on automatic control. 2009, Vol 54, Num 7, pp 1515-1531, issn 0018-9286, 17 p.Article

Set intersection theorems and existence of optimal solutionsBERTSEKAS, Dimitri P; TSENG, Paul.Mathematical programming. 2007, Vol 110, Num 2, pp 287-314, issn 0025-5610, 28 p.Article

Stochastic approximation for nonexpansive maps: Application to Q-learning algorithmsABOUNADI, Jinane; BERTSEKAS, Dimitri P; BORKAR, Vivek et al.SIAM journal on control and optimization. 2003, Vol 41, Num 1, pp 1-22, issn 0363-0129, 22 p.Article

Large Scale Optimization: Analysis, Algorithms and ApplicationsBERTSEKAS, Dimitri P; LUO, Zhi-Quan.Mathematical programming (Print). 2011, Vol 129, Num 2, issn 0025-5610, 243 p.Conference Proceedings

Random algorithms for convex minimization problemsNEDIC, Angelia.Mathematical programming (Print). 2011, Vol 129, Num 2, pp 225-253, issn 0025-5610, 29 p.Conference Paper

Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problemsMAN-CHO SO, Anthony.Mathematical programming (Print). 2011, Vol 129, Num 2, pp 357-382, issn 0025-5610, 26 p.Conference Paper

On the complexity of computing the handicap of a sufficient matrixDE KLERK, Etienne; NAGY, Marianna E.Mathematical programming (Print). 2011, Vol 129, Num 2, pp 383-402, issn 0025-5610, 20 p.Conference Paper

A block coordinate gradient descent method for regularized convex separable optimization and covariance selectionSANGWOON YUN; TSENG, Paul; TOH, Kim-Chuan et al.Mathematical programming (Print). 2011, Vol 129, Num 2, pp 331-355, issn 0025-5610, 25 p.Conference Paper

Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximationXIAO JIN ZHENG; XIAO LING SUN; DUAN LI et al.Mathematical programming (Print). 2011, Vol 129, Num 2, pp 301-329, issn 0025-5610, 29 p.Conference Paper

A note on the complexity of Lp minimizationDONGDONG GE; XIAOYE JIANG; YINYU YE et al.Mathematical programming (Print). 2011, Vol 129, Num 2, pp 285-299, issn 0025-5610, 15 p.Conference Paper

Distributed multi-agent optimization with state-dependent communicationLOBEL, Ilan; OZDAGLAR, Asuman; FEIJER, Diego et al.Mathematical programming (Print). 2011, Vol 129, Num 2, pp 255-284, issn 0025-5610, 30 p.Conference Paper

A stackelberg game approach to distributed spectrum managementRAZAVIYAYN, Meisam; LUO, Zhi-Quan; TSENG, Paul et al.Mathematical programming (Print). 2011, Vol 129, Num 2, pp 197-224, issn 0025-5610, 28 p.Conference Paper

Projected equation methods for approximate solution of large linear systemsBERTSEKAS, Dimitri P; HUIZHEN YU.Journal of computational and applied mathematics. 2009, Vol 227, Num 1, pp 27-50, issn 0377-0427, 24 p.Conference Paper

Dynamic programming and suboptimal control : A survey from ADP to MPCBERTSEKAS, Dimitri P.European journal of control. 2005, Vol 11, Num 4-5, pp 310-334, issn 0947-3580, 25 p.Conference Paper